Implementation of Greedy Sequential Unique Path

Digital Forensic Analyst encounters a mixed file fragments in the absence of File Table information i.e., files‟ metadata. File Carving is a process of reconstructing files from mixed file fragments without using files‟ metadata. File Carving is an interesting and challenging problem in digital forensics and Data Recovery. Recently there have been number of research papers in the area of File Carving. In this paper authors describe File Carving and present its Literature Survey. The implementation of Greedy Sequential Unique Path File Carving algorithm for 4-bit bitmap files, with the help of function prototypes using C language and brief explanation of these prototypes is explained. The experimental results are also shown. The experimental results show that the files can be reconstructed from their fragments without knowing files‟ metadata. However there are limitations of these methods as mentioned in section 5. General Terms Greedy Algorithms,, File Carving, File Fragmentation, Digital Forensics, Data Recovery, Disk Clusters, Graph, Paths in a Graph.